Coloring of trees with minimum sum of colors
نویسندگان
چکیده
The chromatic sum Σ(G) of a graph G is the smallest sum of colors among all proper colorings with natural numbers. The strength s(G) of G is the minimum number of colors needed to achieve the chromatic sum. We construct for each positive integer k a tree Tk with strength k that has maximum degree only 2k − 2. The result is best possible.
منابع مشابه
A Variant of the Sum Coloring Problem on Trees
Let G = (V,E) be a simple and connected graph. The graph coloring problem on G is to color the vertices of G such that the colors of any two adjacent vertices are different and the number of used colors is as small as possible. By assigning a positive integer to a color, the sum coloring problem asks the minimum sum of the coloring numbers assigned for all vertices. In this paper, we introduce ...
متن کاملMinimum sum multicoloring on the edges of trees
The edge multicoloring problem is that given a graph G and integer demands x(e) for every edge e, assign a set of x(e) colors to edge e, such that adjacent edges have disjoint sets of colors. In the minimum sum edge multicoloring problem the finish time of an edge is defined to be the highest color assigned to it. The goal is to minimize the sum of the finish times. The main result of the paper...
متن کاملMinimum Sum Multicoloring on the Edges of Planar Graphs and Partial k-trees (Extended Abstract)
The edge multicoloring problem is that given a graph G and integer demands x(e) for every edge e, assign a set of x(e) colors to edge e, such that adjacent edges have disjoint sets of colors. In the minimum sum edge multicoloring problem the finish time of an edge is defined to be the highest color assigned to it. The goal is to minimize the sum of the finish times. The main result of the paper...
متن کاملMinimum Sum Multicoloring on the Edges of Trees: (Extended Abstract)
The edge multicoloring problem is that given a graph G and integer demands x(e) for every edge e, assign a set of x(e) colors to edge e, such that adjacent edges have disjoint sets of colors. In the minimum sum edge multicoloring problem the finish time of an edge is defined to be the highest color assigned to it. The goal is to minimize the sum of the finish times. The main result of the paper...
متن کاملTight bounds on the chromatic sum of a connected graph
The chromatic sum of a graph is introduced in the dissertation of Ewa Kubicka. It is the smallest possible total among all proper colorings of G using natural numbers. In this article we determine tight bounds on the chromatic sum of a connected graph with e edges, 1. THE CHROMATIC SUM A proper coloring of the vertices of the graph G must assign different colors to adjacent vertices. The chroma...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Graph Theory
دوره 32 شماره
صفحات -
تاریخ انتشار 1999